Efficient Linear Discriminant Analysis Using a Fast Quadratic Programming Algorithm
نویسندگان
چکیده
An algorithm is proposed for performing linear discriminant analysis using a single-layered feedforward network. The algorithm follows successive steepest descent directions with respect to the perceptron cost function, taking care not to increase the number of misclassified patterns. The algorithm has no free parameters and therefore no heuristics are involved in its application. Its efficiency in terms of speed of convergence is demonstrated in a number of pattern classification problems.
منابع مشابه
A TRUST-REGION SEQUENTIAL QUADRATIC PROGRAMMING WITH NEW SIMPLE FILTER AS AN EFFICIENT AND ROBUST FIRST-ORDER RELIABILITY METHOD
The real-world applications addressing the nonlinear functions of multiple variables could be implicitly assessed through structural reliability analysis. This study establishes an efficient algorithm for resolving highly nonlinear structural reliability problems. To this end, first a numerical nonlinear optimization algorithm with a new simple filter is defined to locate and estimate the most ...
متن کاملDiscriminant Kernel Learning Discriminant Kernel Learning via Convex Programming
Regularized Kernel Discriminant Analysis (RKDA) performs linear discriminant analysis in the feature space via the kernel trick. Its performance depends on the selection of kernels. We show that this kernel learning problem can be formulated as a semidefinite program (SDP). Based on the equivalence relationship between RKDA and least square problems in the binary-class case, we propose an effic...
متن کاملMaximum margin equalizers trained with the Adatron algorithm
In this paper we apply the structural risk minimization principle as an appropriate criterion to train decision feedback and transversal equalizers. We consider both linear discriminant (optimal hyperplane) and nonlinear discriminant (support vector machine) classi6ers as an alternative to the linear minimum mean-square error (MMSE) equalizer and radial basis function (RBF) networks, respective...
متن کاملAn iterative method for tri-level quadratic fractional programming problems using fuzzy goal programming approach
Tri-level optimization problems are optimization problems with three nested hierarchical structures, where in most cases conflicting objectives are set at each level of hierarchy. Such problems are common in management, engineering designs and in decision making situations in general, and are known to be strongly NP-hard. Existing solution methods lack universality in solving these types of pro...
متن کاملA Fast Fixed-Point Algorithm for Two-Class Discriminative Feature Extraction
We propose a fast fixed-point algorithm to improve the Relevant Component Analysis (RCA) in two-class cases. Using an objective function that maximizes the predictive information, our method is able to extract more than one discriminative component of data for two-class problems, which cannot be accomplished by classical Fisher’s discriminant analysis. After prewhitening the data, we apply Newt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998